Journal of Artificial Intelligence Research755 Submitted 08/08; publishedEfficient Informative Sensing using Multiple Robots Amarjeet Singh

Source URL: select.cs.cmu.edu

• Mathematics
• Applied mathematics
• Theoretical computer science
• Routing algorithms
• Combinatorial optimization
• Search algorithms
• Game artificial intelligence
• Algorithm
• A* search algorithm
• Submodular set function
• Motion planning
• Greedy algorithm

PDF Document

Source URL: www-irma.u-strasbg.fr

• Mathematical analysis
• Mathematics
• Complex dynamics
• French mathematicians
• Fractals
• French people
• Pierre Fatou
• Paul Montel
• Gaston Julia
• Holomorphic function
• Julia set
• Michle Audin

A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory Adam Yedidia Scott Aaronson

Source URL: www.scottaaronson.com

• Mathematics
• Theoretical computer science
• Computability theory
• Mathematical logic
• Theory of computation
• Turing machine
• Models of computation
• Busy beaver
• Halting problem
• ZermeloFraenkel set theory
• Computability
• Computable function

A Level-set Hit-and-run Sampler for Quasi-Concave Distributions Shane T. Jensen and Dean P. Foster Department of Statistics, The Wharton School, University of Pennsylvania Abstract

Source URL: www-stat.wharton.upenn.edu

• Monte Carlo methods
• Markov chain Monte Carlo
• Non-uniform random numbers
• Probability distributions
• Computational statistics
• Gibbs sampling
• Rejection sampling
• MetropolisHastings algorithm
• Slice sampling
• Bayesian network
• Quasiconvex function
• Normal distribution

On Aggregation Sets and Lower-Convex Sets Tiantian Mao∗† and Ruodu Wang† November 24, 2014 Abstract It has been a challenge to characterize the set of all possible sums of random variables

Source URL: sas.uwaterloo.ca

• Probability theory
• Generalized functions
• Convex analysis
• Convergence
• Convergence of random variables
• Convex function
• Stochastic ordering
• Expected value
• Uniform integrability
• Distribution
• Continuous game
• Fourier transform

ALGEBRAIC STRUCTURE AND DEGREE REDUCTION Let S ⊂ Fn . We define deg(S) to be the minimal degree of a non-zero polynomial that vanishes on S. We have seen that for a finite set S, deg(S) ≤ n|S|1/n . In fact, we can sa

Source URL: math.mit.edu

• Mathematics
• Mathematical analysis
• Algebra
• Polynomials
• Transcendental numbers
• Diophantine approximation
• Coding theory
• Algebraic function
• Elliptic curve

Game characterizations of function classes and Weihrauch degrees MSc Thesis (Afstudeerscriptie) written by Hugo de Holanda Cunha Nobrega (born September 5, 1987 in Petrópolis, Brazil)

Source URL: www.illc.uva.nl

• Mathematical logic
• Mathematics
• Set theory
• Descriptive set theory
• Wadge hierarchy
• Determinacy
• Axiom of countable choice
• Ordinal numbers
• -consistent theory
• Ordinal arithmetic

APPROXIMATIONS OF CONVEX BODIES BY POLYTOPES AND BY PROJECTIONS OF SPECTRAHEDRA Alexander Barvinok April 2012 Abstract. We prove that for any compact set B ⊂ Rd and for any ǫ > 0 there is a

Source URL: www.math.lsa.umich.edu

• Algebra
• Mathematics
• Linear algebra
• Mathematical analysis
• Convex analysis
• Mathematical optimization
• Real algebraic geometry
• Matrices
• Semidefinite programming
• Convex cone
• Matrix
• Convex function

Journal of Machine Learning Research2801 Submitted 1/08; Revised 9/08; PublishedRobust Submodular Observation Selection Andreas Krause

Source URL: select.cs.cmu.edu

• Computational complexity theory
• Theory of computation
• Mathematics
• Submodular set function
• Greedy algorithm
• Algorithm
• Optimization problem
• Reduction
• NP
• Time complexity

Interpolation Interpolation is the process of finding a function f (x) whose graph passes through a given set of data points (x0 , y0 ), (x1 , y1 ), ... (xn , yn ). In other words, we know the values of the function at n

Source URL: www.maths.dit.ie